A Discourse on Completely Regular Space
نویسندگان
چکیده
منابع مشابه
A metrizable completely regular ordered space
We construct a completely regular ordered space (X, T ,≤) such that X is an I-space, the topology T of X is metrizable and the bitopological space (X, T ♯,T ♭) is pairwise regular, but not pairwise completely regular. (Here T ♯ denotes the upper topology and T ♭ the lower topology of X.)
متن کاملOmpactification of Completely Regular Frames based on their Cozero Part
Let L be a frame. We denoted the set of all regular ideals of cozL by rId(cozL) . The aim of this paper is to study these ideals. For a frame L , we show that rId(cozL) is a compact completely regular frame and the map jc : rId(cozL)→L given by jc (I)=⋁I is a compactification of L which is isomorphism to its Stone–Čech compactification and is proved that jc have a right adjoint rc : L →...
متن کاملOn Completely Regular Ternary Semiring
We introduce and study the notion of a completely regular ternary semiring. Necessary and sufficient conditions for a ternary semiring to be completely regular are furnished. AMS Mathematics Subject Classification (2010): 16Y30, 16Y99
متن کاملOn non-antipodal binary completely regular codes
Binary non-antipodal completely regular codes are characterized. Using the result on nonexistence of nontrivial binary perfect codes, it is concluded that there are no unknown nontrivial non-antipodal completely regular binary codes with minimum distance d ≥ 3. The only such codes are halves and punctered halves of known binary perfect codes. Thus, new such codes with covering radiuses ρ = 2, 3...
متن کاملOn nested completely regular codes and distance regular graphs
Infinite families of linear binary nested completely regular codes with covering radius ρ equal to 3 and 4 are constructed. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter D = 3 or 4 are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archives of Current Research International
سال: 2019
ISSN: 2454-7077
DOI: 10.9734/acri/2019/v17i330115